Upper Bounds for Erdös-Hajnal Coefficients of Tournaments
نویسنده
چکیده
A version of the Erdős-Hajnal conjecture for tournaments states that for every tournament H every tournament T that does not contain H as a subtournament, contains a transitive subtournament of size at least n (H) for some (H) > 0, where n is the order of T . For any fixed tournament H we can denote by n0(H) the supremum over all ≥ 0 satisfying the following statement: every tournament T of order n ≥ n0 that does not contain H as a subtournament, contains a transitive subtournament of size at least n . The Erdős-Hajnal conjecture is true iff for every tournament H the limit limn0→∞ n0(H), denoted as ξ(H), is positive. The main goal of this talk is to give the upper bounds for the parameter ξ(H), called by us the Erdős-Hajnal coefficient of a tournament H, for many classes of tournaments H. We will also define tournaments called the pseudocelebrities, discuss their properties and mention some open problems that relate pseudocelebrities to the Erdős-Hajnal conjecture.
منابع مشابه
Coloring tournaments with forbidden substructures
Coloring graphs is an important algorithmic problem in combinatorics with many applications in computer science. In this paper we study coloring tournaments. A chromatic number of a random tournament is of order Ω( n log(n)). The question arises whether the chromatic number can be proven to be smaller for more structured nontrivial classes of tournaments. We analyze the class of tournaments def...
متن کاملOn two-path convexity in multipartite tournaments
In the context of two-path convexity, we study the rank, Helly number, Radon number, Caratheodory number, and hull number for multipartite tournaments. We show the maximum Caratheodory number of a multipartite tournament is 3. We then derive tight upper bounds for rank in both general multipartite tournaments and clone-free multipartite tournaments. We show that these same tight upper bounds ho...
متن کاملTwo-path convexity in clone-free regular multipartite tournaments
We present some results on two-path convexity in clone-free regular multipartite tournaments. After proving a structural result for regular multipartite tournaments with convexly independent sets of a given size, we determine tight upper bounds for their size (called the rank) in clone-free regular bipartite and tripartite tournaments. We use this to determine tight upper bounds for the Helly a...
متن کاملA Recurrence for Bounds on Dominating Sets in k-Majority Tournaments
A k-majority tournament is realized by 2k−1 linear orders on the set of vertices, where a vertex u dominates v if u precedes v in at least k of the orders. Various properties of such tournaments have been studied, among them the problem of finding the size of a smallest dominating set. It is known that 2-majority tournaments are dominated by 3 vertices and that k-majority tournaments are domina...
متن کاملOn the Erdős-Hajnal conjecture for six-vertex tournaments
A celebrated unresolved conjecture of Erdős and Hajnal states that for every undirected graph H there exists (H) > 0 such that every undirected graph on n vertices that does not contain H as an induced subgraph contains a clique or stable set of size at least n (H). The conjecture has a directed equivalent version stating that for every tournament H there exists (H) > 0 such that every H-free n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 74 شماره
صفحات -
تاریخ انتشار 2013